#include <iostream>

using namespace std;

typedef long long LL;

const int N = 1e5 + 10;
const LL P = 1e9 + 7;
int n;
LL f[N * 2], g[N * 2];

LL qpow(LL a, LL b, LL p)
{
	LL ret = 1;
	while(b)
	{
		if(b & 1) ret = ret * a % p;
		b >>= 1;
		a = a * a % p;	
	}	
	return ret;
} 

void init()
{
	f[0] = 1;
	for(int i = 1; i <= n * 2; i++) f[i] = f[i - 1] * i % P;
	
	int m = 2 * n;
	g[m] =  qpow(f[m], P - 2, P);
	for(int i = m - 1; i >= 0; i--) g[i] = g[i + 1] * (i + 1) % P;
}

int main()
{
	cin >> n;
	init();
	cout << f[2 * n] * g[n] % P * g[n + 1] % P << endl;;
	return 0;
}

